Preconditioned iterative methods for linear discrete ill-posed problems from a Bayesian inversion perspective
نویسندگان
چکیده
منابع مشابه
Preconditioned iterative methods for linear discrete ill-posed problems from a Bayesian inversion perspective
In this paper we revisit the solution of ill-posed problems by preconditioned iterative methods from a Bayesian statistical inversion perspective. After a brief review of the most popular Krylov subspace iterative methods for the solution of linear discrete illposed problems and some basic statistics results, we analyze the statistical meaning of left and right preconditioners, as well as proje...
متن کاملIterative Solution Methods for Large Linear Discrete Ill-posed Problems
This paper discusses iterative methods for the solution of very large severely ill-conditioned linear systems of equations that arise from the discretization of linear ill-posed problems. The right-hand side vector represents the given data and is assumed to be contaminated by errors. Solution methods proposed in the literature employ some form of ltering to reduce the in uence of the error in ...
متن کاملA family of range restricted iterative methods for linear discrete ill-posed problems
The solution of large linear systems of equations with a matrix of ill-determined rank and an error-contaminated right-hand side requires the use of specially designed iterative methods in order to avoid severe error propagation. The choice of solution subspace is important for the quality of the computed approximate solution, because this solution typically is determined in a subspace of fairl...
متن کاملFGMRES for linear discrete ill-posed problems
GMRES is one of the most popular iterative methods for the solution of large linear systems of equations. However, GMRES generally does not perform well when applied to the solution of linear systems of equations that arise from the discretization of linear ill-posed problems with error-contaminated data represented by the right-hand side. Such linear systems are commonly referred to as linear ...
متن کاملOn the Choice of Subspace for Iterative Methods for Linear Discrete Ill-posed Problems
with a large matrix A of ill-determined rank. Thus, A has many “tiny” singular values of different orders of magnitude. In particular, A is severely ill-conditioned. Some of the singular values of A may be vanishing. We allow m ≥ n or m < n. The right-hand side vector b̃ is not required to be in the range of A. Linear systems of equations of the form (1) with a matrix of ill-determined rank are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2007
ISSN: 0377-0427
DOI: 10.1016/j.cam.2005.10.038